An Exact Algorithm for Steiner Tree Problem on Graphs

An Exact Algorithm for Steiner Tree Problem on Graphs

The paper presents a new original algorithm for solving Steiner tree problem on graph. The algorithm is simple and intended for solving problems with relatively low dimensions. It is based on use of existing open source software for solving integer linear programming problems. The algorithm is tested and shown very efficient for different randomly generated problems on graphs of up to 50 nodes,...

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem

An Exact Algorithm for the Steiner Tree Problem with Delays

The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a Branch-and-Cut algorithm for solving this problem using a formulation based on lifted Miller-TuckerZemlin subtour elimination constraints. The effectiveness of the proposed algo...

An Ant Algorithm for the Steiner Tree Problem in Graphs

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, since it is the mathematical structure behind multi-cast communications. The goal of this paper is to design an ant algorithm (called ANT-STP) for the STP in graphs which is better than TM, which is a greedy constructive method for th...

An Exact Rectilinear Steiner Tree Algorithm

Given a set of terminals in the plane, a rectilin-ear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for an input terminal set. On a workstation, problems involving 20 input terminals can be solved in a few seconds, and problems involving 30 input termin...